Problem #1

parser terminal symbol abstract class method abstract syntax tree pushdown automaton grammar rule automatic parser generator

handle instance arbitrary rewrite system syntax directed translation rvalue leftmost derivation reduce/reduce error

Problem #2

Problem #3

a) Identify which sentences are recognized by this automaton.

	Yes	No		aab
	Yes	No		bbabca
	Yes	No		bcaabaaabaa
	Yes	No		bbcb
	Yes	No		abbbbabbabca

b) Show a left regular grammar that specifies the language recognized by the fsa. (Hint: write a grammar rule which would produce the fsa using the algorithm given in class.)

c) Describe in English the language recognized by the fsa.

Problem #4

a) Show the parse tree for the sentence "( ( a ( a ) ) )".

b) Show the parser configurations as it parses that input in the following table. You must use state numbers on the syntax stack. (Hint: 22 configurations are shown in the table -- the parse may take less than, more than, or equal to that number of steps.)

step	stack	input	action
1	0	( ( a ( a ) ) ) $	shift 3
2	0 3	( a ( a ) ) ) $	shift 3
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

Problem #5

	package p;
	public class C {
		public int x;
		protected double y;
		private char z;
		public char getZ( ) { return z; }
	}

	package p;
	public class D extends C {
		String S;
		public void f( ) {
			S = ((Integer)x).toString( );
		}
	}

	package p;
	public class Hello {
		public static void main(String[] args) {
			C ac = new C();
			D ad = new D();
		}
	}

a) Which instance variables can be accessed using the object ac in the method main?

b) Which instance variables can be accessed using the object ad in the method main?

c) Which instance variables can be accessed in the method called by D.f() in the method main?